Online Caching Networks with Adversarial Guarantees

We study a cache network under arbitrary adversarial request arrivals. propose distributed online policy based on the tabular greedy algorithm. Our achieves sublinear (1-1/e)-regret, also in case when update costs cannot be neglected. Numerical evaluation over several topologies supports our theoretical results and demonstrates that algorithm outperforms state-of-art algorithms.